Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
11	Algorithms and Data Structures Winter TermExercises for UnitIn a basketball tournament n teams play against each other (possibly multiple times) in a pre-determined sequence. The winner of a game gets one Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-20 15:51:01 Graph theory Mathematics Network flow Graph connectivity Combinatorial optimization Routing algorithms Matching FordFulkerson algorithm Maximum flow problem Flow network Cut Graph
12	Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2008-03-13 06:46:48 Network flow Graph theory Mathematics Maximum flow problem Flow network Max-flow min-cut theorem Minimum-cost flow problem Matching Minimum cut Approximate max-flow min-cut theorem FordFulkerson algorithm
13	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
14	Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Search algorithms Graph theory Data structures Information science Information retrieval Disjoint-set data structure Binary trees Minimum spanning tree Routing algorithms Link/cut tree HeldKarp algorithm
15	Microsoft Word - WebArchiving_v6.doc Add to Reading List Source URL: wiki.umiacs.umd.edu Language: English - Date: 2008-09-10 16:29:18 Combinatorial optimization NP-complete problems Graph partition PageRank Graph Cut Matching Minimum cut Graph theory Line graph
16	In IEEE Transactions on PAMI, Vol. 26, No. 9, pp, Septp.1 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2004-08-04 12:47:16 Network flow Combinatorial optimization Flow network Operations research Maximum flow problem Cut FordFulkerson algorithm Minimum cut Shortest path problem Planar graph Split Topology
17	Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Polygons NP-complete problems Computational problems Computational geometry Combinatorial optimization Art gallery problem Visibility graph Simple polygon Clique Cut Optimization problem Polygon covering
18	CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-09-26 19:00:24 NP-complete problems Planted clique Clique problem Clique Graph partition Maximum cut Probability distribution
19	Spectral Algorithms for Graph Mining and Analysis Yiannis Kou:s University of Puerto Rico -‐ Rio Piedras Add to Reading List Source URL: mmds-data.org Language: English - Date: 2014-06-24 17:32:46 Combinatorial optimization Cut Graph connectivity Eigenvalues and eigenvectors Spectral graph theory Graph partition
20	Spectral Graph Theory and its Applications September 14, 2004 Lecture 4 Lecturer: Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2005-06-30 12:02:45 NP-complete problems Combinatorial optimization Graph partition Cut Graph Planar separator theorem Hypergraph

UPDATE